Batched Interpolation Search
نویسندگان
چکیده
منابع مشابه
Batched Search of Index Sequential Files
The performance of batched search when applied to index sequential files is studied. Analysis provides exact formulae for the cost of searching when batching is applied as a function of the magnitude of the query and time. The analysis takes into account (a) accesses to the overflow area only, and (b) accesses to both primary and overflow area, as well as whether the records of the query are (a...
متن کاملDynamic Interpolation Search Revisited
A new dynamic Interpolation Search (IS) data structure is presented that achieves O(log log n) search time with high probability on unknown continuous or even discrete input distributions with measurable probability of key collisions, including power law and Binomial distributions. No such previous result holds for IS when the probability of key collisions is measurable. Moreover, our data stru...
متن کاملBatched Lazy Decision Trees
We introduce a batched lazy algorithm for supervised classification using decision trees. It avoids unnecessary visits to irrelevant nodes when it is used to make predictions with either eagerly or lazily trained decision trees. A set of experiments demonstrate that the proposed algorithm can outperform both the conventional and lazy decision tree algorithms in terms of computation time as well...
متن کاملBatched bin packing
We introduce and study the batched bin packing problem (BBPP), a bin packing problem in which items become available for packing incrementally, one batch at a time. A batched algorithm must pack a batch before the next batch becomes known. A batch may contain several items; the special case when each batch consists of merely one item is the well-studied on-line bin packing problem. We obtain lo...
متن کاملGeometrically batched networks
We develop approximate solutions for the equilibrium queue length probability distribution of queues in open Markovian networks by considering each queue independently, constructing its arrival process as the join of each contributing queue's departing traffic. Without modulation and non-unit batches, we would only need to consider mean internal traffic rates, modelling each queue as M/M/1 to g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1987
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/30.6.565